On weight functions which admit explicit Gauss-Turán quadrature formulas
نویسندگان
چکیده
The main purpose of this paper is the construction of explicit Gauss-Turán quadrature formulas: they are relative to some classes of weight functions, which have the peculiarity that the corresponding s-orthogonal polynomials, of the same degree, are independent of s. These weights too are introduced and discussed here. Moreover, highest-precision quadratures for evaluating Fourier-Chebyshev coefficients are given.
منابع مشابه
Maximum of the modulus of kernels in Gauss-Turán quadratures
We study the kernels Kn,s(z) in the remainder terms Rn,s(f) of the Gauss-Turán quadrature formulae for analytic functions on elliptical contours with foci at ±1, when the weight ω is a generalized Chebyshev weight function. For the generalized Chebyshev weight of the first (third) kind, it is shown that the modulus of the kernel |Kn,s(z)| attains its maximum on the real axis (positive real semi...
متن کاملError estimates for Gauss–Turán quadratures and their Kronrod extensions
We study the kernel Kn,s(z) of the remainder term Rn,s( f ) of Gauss–Turán–Kronrod quadrature rules with respect to one of the generalized Chebyshev weight functions for analytic functions. The location on the elliptic contours where the modulus of the kernel attains its maximum value is investigated. This leads to effective L∞-error bounds of Gauss–Turán–Kronrod quadratures. Following Kronrod,...
متن کاملComputing rational Gauss-Chebyshev quadrature formulas with complex poles
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [−1, 1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.
متن کاملOn computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملExplicit Hermite Interpolation Polynomials via the Cycle Index with Applications
The cycle index polynomial of a symmetric group is a basic tool in combinatorics and especially in Pólya enumeration theory. It seems irrelevant to numerical analysis. Through Faá di Bruno’s formula, cycle index is connected with numerical analysis. In this work, the Hermite interpolation polynomial is explicitly expressed in terms of cycle index. Applications in Gauss-Turán quadrature formula ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996